Hedging Uncertainty: Approximation Algorithms for Stochastic Optimization Problems
نویسندگان
چکیده
We study two-stage, finite-scenario stochastic versions of several combinatorial optimization problems, and provide nearly tight approximation algorithms for them. Our problems range from the graph-theoretic (shortest path, vertex cover, facility location) to set-theoretic (set cover, bin packing), and contain representatives with different approximation ratios. The approximation ratio of the stochastic variant of a typical problem is found to be of the same order of magnitude as its deterministic counterpart. Furthermore, we show that common techniques for designing approximation algorithms such as LP rounding, the primal-dual method, and the greedy algorithm, can be adapted to obtain these results.
منابع مشابه
Three Hybrid Metaheuristic Algorithms for Stochastic Flexible Flow Shop Scheduling Problem with Preventive Maintenance and Budget Constraint
Stochastic flexible flow shop scheduling problem (SFFSSP) is one the main focus of researchers due to the complexity arises from inherent uncertainties and also the difficulty of solving such NP-hard problems. Conventionally, in such problems each machine’s job process time may encounter uncertainty due to their relevant random behaviour. In order to examine such problems more realistically, fi...
متن کاملSampling-Based Progressive Hedging Algorithms in Two-Stage Stochastic Programming
Abstract Most real-world optimization problems are subject to uncertainties in parameters. In many situations where the uncertainties can be estimated to a certain degree, various stochastic programming (SP) methodologies are used to identify robust plans. Despite substantial advances in SP, it is still a challenge to solve practical SP problems, partially due to the exponentially increasing nu...
متن کاملA Short Survey of Aproximation Algorithms for Combinatorial Optimization under Uncertainty∗
This paper briefly describes three well-established frameworks for handling uncertainty in optimization problems. Our focus is mainly on combinatorial optimization and on the development of approximation algorithms under the discussed frameworks. In particular, we give a brief overview of Stochastic Programming, Robust Optimization, and Probabilistic Combinatorial Optimization, and list approxi...
متن کاملRandom-Direction Optimization Algorithms with Applications to Threshold Controls
This work develops a class of stochastic optimization algorithms. It aims to provide numerical procedures for solving thresholdtype optimal control problems. The main motivation stems from applications involving optimal or suboptimal hedging policies, for example, production planning of manufacturing systems including random demand and stochastic machine capacity. The proposed algorithm is a co...
متن کاملA Bi-objective Stochastic Optimization Model for Humanitarian Relief Chain by Using Evolutionary Algorithms
Due to the increasing amount of natural disasters such as earthquakes and floods and unnatural disasters such as war and terrorist attacks, Humanitarian Relief Chain (HRC) is taken into consideration of most countries. Besides, this paper aims to contribute humanitarian relief chains under uncertainty. In this paper, we address a humanitarian logistics network design problem including local dis...
متن کامل